Determining statistical dominance by linear programming
نویسندگان
چکیده
منابع مشابه
Determining a common set of weights in DEA by solving a linear programming
In models of Data Envelopment Analysis (DEA), an optimal set of input and output weights is generally as-sumed to represent the assessed Decision Making Unit (DMU) in the best light in comparison to all the other DMUs. These sets of weights are, typically, different for each of the participating DMUs. Thus, it is important to find a Common Set of Weights (CSW) across the set of DMUs. In this pa...
متن کاملA Local Dominance Procedure for Mixed-Integer Linear Programming
Among the hardest Mixed-Integer Linear Programming (MILP) problems, the ones that exhibit a symmetric nature are particularly important in practice, as they arise in both theoretical and practical combinatorial optimization problems. A theoretical concept that generalizes the notion of symmetry is that of dominance. This concept, although known since a long time, is typically not used in genera...
متن کاملdetermining a common set of weights in dea by solving a linear programming
in models of data envelopment analysis (dea), an optimal set of input and output weights is generally as-sumed to represent the assessed decision making unit (dmu) in the best light in comparison to all the other dmus. these sets of weights are, typically, different for each of the participating dmus. thus, it is important to find a common set of weights (csw) across the set of dmus. in this pa...
متن کاملDetermining Weights in Multi-Objective Linear Programming under Fuzziness
This study presents a method to determine weights of objectives in multi objective linear programming without decision maker/s preference. The method is developed by modifying Belenson and Kapur’s approach under fuzziness. It is used two-person zero-sum game with mixed strategies. Degree of linear membership functions of objectives are used in pay-off matrix. The proposed method is shown with a...
متن کاملInterpolation by Linear Programming
Given m,n ≥ 2 and > 0, we compute a function taking prescribed values at N given points of R, and having C norm as small as possible up to a factor 1 + . Our computation reduces matters to a linear programming problem.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of the Australian Mathematical Society. Series B. Applied Mathematics
سال: 1988
ISSN: 0334-2700,1839-4078
DOI: 10.1017/s0334270000005798